Verification of logic programs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of Logic Programs

We present a p roof method in the style of Hoare 's logic, aimed at providing a unifying framework for the verification o f total correctness of logic and Prolog programs. The method. which relies on purely declarative reasoning, has been designed as a trade-off between expressiveness and ease of use. On the basis of a few simple principles, we reason uniformly on several properties of logic an...

متن کامل

Verification of Logic Programs and Imperative Programs

This paper explores the relationship between veriication of logic programs and imperative programs with the aim of uncovering the kinds of reasoning used to construct logic programs. We discuss forward reasoning, such as that used for verifying imperative programs using the inductive assertion method, and backward reasoning, such as that used for verifying imperative programs using subgoal indu...

متن کامل

Abstract Interpretation based Verification of Logic Programs

Interpretation based Verification of Logic Programs Marco Comini, Roberta Gori, Giorgio Levi, Paolo Volpe Dipartimento di Informatica Università di Pisa Pisa, Italy

متن کامل

Forward versus Backward Verification of Logic Programs

One recent development in logic programming has been the application of abstract interpretation to verify the partial correctness of a logic program with respect to a given set of assertions. One approach to verification is to apply forward analysis that starts with an initial goal and traces the execution in the direction of the control-flow to approximate the program state at each program poi...

متن کامل

Verification of Logic Programs with Delay Declarations

Logic programs augmented with delay declarations form a higly expressive programming language in which dynamic networks of processes that communicate asynchronously by means of multiparty channels can be easily created. In this paper we study correctness these programs. In particular, we propose proof methods allowing us to deal with occur check freedom, absence of deadlock, absence of errors i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Logic Programming

سال: 1999

ISSN: 0743-1066

DOI: 10.1016/s0743-1066(98)10035-3